/*Demacia of the Ancients
There is a popular multiplayer online battle arena game called Demacia of the Ancients. There are lots of professional teams playing this game. A team will be approved as Level K if there are exact K team members whose match making ranking (MMR) is strictly greater than 6000.
You are given a list of teams. Please calculate the level of each team.

Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
The first line contains an integer N (1 <= N <= 10) indicating the number of team members.
The second line contains N integers representing the MMR of each team member. All MMRs are non-negative integers less than or equal to 9999.

Output
For each test case, output the level of the given team.

Sample Input
3
5
7986 6984 6645 6200 6150
5
7401 7377 6900 6000 4300
3
800 600 200

Sample Output
5
3
0
思路：统计大于6000的数字的数量
*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <map>
const int maxn = 1111;
using namespace std;

int main()
{
    int T, n, m;
    scanf("%d", &T);
    while (T --)
    {
        int sum = 0;
        scanf("%d", &n);
        for (int i = 1;i <= n;i ++)
        {
            scanf("%d", &m);
            if (m > 6000)
                sum += 1;
        }
        printf("%d\n", sum);
    }
    return 0;
}
